ADI iteration for Lyapunov equations: a tangential approach and adaptive shift selection
نویسندگان
چکیده
A new version of the alternating directions implicit (ADI) iteration for the solution of large-scale Lyapunov equations is introduced. It generalizes the hitherto existing iteration, by incorporating tangential directions in the way they are already available for rational Krylov subspaces. Additionally, first strategies to adaptively select shifts and tangential directions in each iteration are presented. Numerical examples emphasize the potential of the new results.
منابع مشابه
Finite-Rank ADI Iteration for Operator Lyapunov Equations
We give an algorithmic approach to the approximative solution of operator Lyapunov equations for controllability. Motivated by the successfully applied alternating direction implicit (ADI) iteration for matrix Lyapunov equations, we consider this method for the determination of Gramian operators of infinite-dimensional control systems. In the case where the input space is finitedimensional, thi...
متن کاملOn the Parameter Selection Problem in the Newton-adi Iteration for Large Scale Riccati Equations
The numerical treatment of linear-quadratic regulator problems for parabolic partial differential equations (PDEs) on infinite time horizons requires the solution of large scale algebraic Riccati equations (ARE). The Newton-ADI iteration is an efficient numerical method for this task. It includes the solution of a Lyapunov equation by the alternating directions implicit (ADI) algorithm in each ...
متن کاملA Parameter Free ADI-like Method for the Numerical Solution of Large Scale Lyapunov Equations
An algorithm is presented for constructing an approximate numerical solution to a large scale Lyapunov equation in low rank factored form. The algorithm is based upon a synthesis of an approximate power method and an alternating direction implicit (ADI) method. The former is parameter free and tends to be efficient in practice, but there is little theoretical understanding of its convergence pr...
متن کاملComputing real low-rank solutions of Sylvester equations by the factored ADI method
We investigate the factored ADI iteration for large and sparse Sylvester equations. A novel low-rank expression for the associated Sylvester residual is established which enables cheap computations of the residual norm along the iteration, and which yields a reformulated factored ADI iteration. The application to generalized Sylvester equations is considered as well. We also discuss the efficie...
متن کاملSelf-Generating and Efficient Shift Parameters in ADI Methods for Large Lyapunov and Sylvester Equations
Low-rank versions of the alternating direction implicit (ADI) iteration are popular and well established methods for the numerical solution of large-scale Sylvester and Lyapunov equations. Probably the largest disadvantage of these methods is their dependence on a set of shift parameters that are crucial for a fast convergence. Here we compare existing shifts generation strategies that compute ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1312.1142 شماره
صفحات -
تاریخ انتشار 2013